Improved Sketching of Hamming Distance with Error Correcting
نویسندگان
چکیده
We address the problem of sketching the hamming distance of data streams. We present a new notion of sketching technique, Fixable sketches and we show that using such sketch not only we reduce the sketch size, but also restore the differences between the streams. Our contribution: For two streams with hamming distance bounded by k we show a sketch of size O(k logn) with O(logn) processing time per new element in the stream and how to restore all locations where the two streams differ in time linear in the sketch size. Probability of error is less than 1/n.
منابع مشابه
Comparative Analysis of Error Correcting Codes for Noisy Channel
In the communication system there are errors during the transmission of the information. There are error correcting codes to detect as well as correct errors. These error correcting codes have vast field of application. Communication performance is improved by enabling the transmitted signal to better withstand the effects of channel impairments such as noise, interference and fading which occu...
متن کاملOn multiple insertion/Deletion correcting codes
We investigate binary, number-theoretic, bit insertion/deletion correcting codes as pioneered by Levenshtein. The weight spectra and Hamming distance properties of single insertion/deletion error-correcting codes are analyzed. These relationships are then extended to investigate codes that can correct multiple random insertions and deletions. From these relationships, new bounds are derived and...
متن کاملRank error-correcting pairs
Error-correcting pairs were introduced independently by Pellikaan and Kötter as a general method of decoding linear codes with respect to the Hamming metric using coordinatewise products of vectors, and are used for many well-known families of codes. In this paper, we define new types of vector products, extending the coordinatewise product, some of which preserve symbolic products of linearize...
متن کاملA Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
I develop methods for analyzing quantum error-correcting codes, and use these methods to construct an infinite class of codes saturating the quantum Hamming bound. These codes encode k = n − j − 2 qubits in n = 2j qubits and correct t = 1 error. 89.80.+h, 03.65.-w Typeset using REVTEX [email protected] 1
متن کامل